A note on discreteness and virtuality in analog computing
نویسندگان
چکیده
منابع مشابه
Computing connectedness: disconnectedness and discreteness
We consider finite point-set approximations of a manifold or fractal with the goal of determining topological properties of the underlying set. We use the minimal spanning tree of the finite set of points to compute the number and size of its -connected components. By extrapolating the limiting behavior of these quantities as → 0 we can say whether the underlying set appears to be connected, to...
متن کاملa study on rate making and required reserves determination in reinsurance market: a simulation
reinsurance is widely recognized as an important instrument in the capital management of an insurance company as well as its risk management tool. this thesis is intended to determine premium rates for different types of reinsurance policies. also, given the fact that the reinsurance coverage of every company depends upon its reserves, so different types of reserves and the method of their calc...
A Note on Distributed Computing
We argue that objects that interact in a distributed system need to be dealt with in ways that are intrinsically different from objects that interact in a single address space. These differences are required because distributed systems require that the programmer be aware of latency, have a different model of memory access, and take into account issues of concurrency and partial failure. We loo...
متن کاملA Note On Pervasive Computing
Pervasive computing is an application-driven field and as such is ill-defined and unstructured for the lack of definitions, algorithms and architectures. Research is primarily guided by visions and beliefs because it is hard to tell, in a scientific way, which systems/applications will penetrate the market. To realize the diverse set of applications, research has to be multidisciplinary, which ...
متن کاملA Note On Computing Set Overlap Classes
Let V be a finite set of n elements and F = {X1, X2, . . . , Xm} a family of m subsets of V. Two sets Xi and Xj of F overlap if Xi∩Xj 6= ∅, Xj \ Xi 6= ∅, and Xi \ Xj 6= ∅. Two sets X, Y ∈ F are in the same overlap class if there is a series X = X1, X2, . . . , Xk = Y of sets of F in which each XiXi+1 overlaps. In this note, we focus on efficiently identifying all overlap classes in O(n + ∑m i=1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.10.017